Efficient Set Operations in the Presence of Malicious Adversaries Carmit Hazay∗ Kobbi Nissim† November 25, 2010

Source URL: www.eng.biu.ac.il

• Computational complexity theory
• Secure multi-party computation
• Commitment scheme
• Homomorphic encryption
• Secure two-party computation
• Paillier cryptosystem
• Oblivious transfer
• Zero-knowledge proof
• Communication complexity
• Cryptography
• Cryptographic protocols
• Public-key cryptography

Computable Real Analysis without Set Theory or Turing Machines Paul Taylor Department of Computer Science University of Manchester UK EPSRC GR/S58522

Source URL: www.paultaylor.eu

• Theory of computation
• Mathematical logic
• General topology
• Functional analysis
• Computable number
• Computable function
• Continuous function
• Baire space
• Topological space
• Computability theory
• Mathematics
• Topology

RACSAM manuscript No. (will be inserted by the editor) On a factorization of Riemann’s ζ function with respect to a quadratic field and its computation Xavier Ros-Oton

Source URL: www.ma.utexas.edu

• Integer sequences
• Analytic number theory
• Combinatorics
• Bernoulli number
• Topology
• Riemann zeta function
• Factorial
• Dedekind zeta function
• Dirichlet character
• Mathematics
• Mathematical analysis
• Number theory

PHYSICAL REVIEW A, VOLUME 65, Robustness of adiabatic quantum computation Andrew M. Childs* and Edward Farhi† Center for Theoretical Physics, Massachusetts Institute of Technology, Cambridge, Massachusetts 0213

Source URL: www.theory.caltech.edu

COMPUTER SCIENCE TRIPOS Part IB – 2013 – Paper 6 4 Computation Theory (AMP) (a) (i ) What does it mean for a λ-term to be a β-normal form? Defining the sets of canonical (C) and neutral (U ) λ-terms by the grammar

Source URL: www.cl.cam.ac.uk

2000 Paper 3 Question 9 Computation Theory One of the most important contributions of the theory of computation has been to establish that the halting problem is not decidable. Give a clear statement of this result (you

Source URL: www.cl.cam.ac.uk

1993 Paper 6 Question 10 Computation Theory Explain what is meant by the following: ‘F is a recursively enumerable set each of whose elements is a total recursive function f : N → N.’

Source URL: www.cl.cam.ac.uk

Doing Thousands of Hypothesis Tests at the Same Time Bradley Efron Abstract The classical theory of hypothesis testing was fashioned for a scientific world of single inferences, small data sets, and slow computation. Ex

Source URL: statweb.stanford.edu

2007 Paper 3 Question 7 Computation Theory (a) (i ) Define the notion of a register machine and the computations that it carries out. [5 marks]

Source URL: www.cl.cam.ac.uk

2009 Paper 6 Question 3 Computation Theory (a) What is meant by a state (or configuration) of a register machine? [2 marks] (b) A register machine program Prog is said to loop at x ∈ N if, when started with register R

Source URL: www.cl.cam.ac.uk